On closed modular colorings of trees
نویسندگان
چکیده
Two vertices u and v in a nontrivial connected graph G are twins if u and v have the same neighbors in V (G) − {u, v}. If u and v are adjacent, they are referred to as true twins; while if u and v are nonadjacent, they are false twins. For a positive integer k, let c : V (G) → Zk be a vertex coloring where adjacent vertices may be assigned the same color. The coloring c induces another vertex coloring c : V (G) → Zk defined by c (v) = ∑ u∈N [v] c(u) for each v ∈ V (G), where N [v] is the closed neighborhood of v. Then c is called a closed modular k-coloring if c(u) 6= c(v) in Zk for all pairs u, v of adjacent vertices that are not true twins. The minimum k for which G has a closed modular k-coloring is the closed modular chromatic number mc(G) of G. The closed modular chromatic number is investigated for trees and determined for several classes of trees. For each tree T in these classes, it is shown that mc(T ) = 2 or mc(T ) = 3. A closed modular k-coloring c of a tree T is called nowhere-zero if c(x) 6= 0 for each vertex x of T . It is shown that every tree of order 3 or more has a nowhere-zero closed modular 4-coloring.
منابع مشابه
An Improved Modular Modeling for Analysis of Closed-Cycle Absorption Cooling Systems
A detailed modular modeling of an absorbent cooling system is presented in this paper. The model including the key components is described in terms of design parameters, inputs, control variables, and outputs. The model is used to simulate the operating conditions for estimating the behavior of individual components and system performance, and to conduct a sensitivity analysis based on the give...
متن کاملQuantum Groups and Knot Theory: Week
One of the most important applications of the RT-functor is the construction of invariants of (closed, connected, oriented) 3-manifolds, the so-called Reshetikhin-Turaev-Witten invariants of 3-manifolds. However, the RT-invariants of ribbon links associated with colorings of links with objects of a ribbon category C in week 46 and week 47 are far too general for this purpose. For this more ambi...
متن کاملEnumerating colorings, tensions and flows in cell complexes
We study quasipolynomials enumerating proper colorings, nowherezero tensions, and nowhere-zero flows in an arbitrary CW-complex X, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may be either modular (with values in Z/kZ for some k) or integral (with values in {−k + 1, . . . , k − 1}). We obtain deletion-contraction recurrences and closed ...
متن کاملAcyclic colorings of products of trees
We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 33 شماره
صفحات -
تاریخ انتشار 2013